/*
 * @lc app=leetcode.cn id=674 lang=javascript
 *
 * [674] 最长连续递增序列
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @return {number}
 */
var findLengthOfLCIS = function(nums) {
    if(nums.length<=1) return nums.length
    let count = 1,max = 0;
    for(let i = 1; i < nums.length; i ++){
        if(nums[i]>nums[i-1]){
            count++
        }else{
            count = 1;
        }
        max = Math.max(max,count)
    }
    return max
};
// @lc code=end

 